Grouping Optimization Based on Social Relationships
نویسندگان
چکیده
منابع مشابه
Multiple Target Tracking in Wireless Sensor Networks Based on Sensor Grouping and Hybrid Iterative-Heuristic Optimization
A novel hybrid method for tracking multiple indistinguishable maneuvering targets using a wireless sensor network is introduced in this paper. The problem of tracking the location of targets is formulated as a Maximum Likelihood Estimation. We propose a hybrid optimization method, which consists of an iterative and a heuristic search method, for finding the location of targets simultaneously. T...
متن کاملGrouping with Directed Relationships
Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and repulsion, each of which can be symmetric or asymmetric. We represent these relationships with two directed graphs. We generalize the normalized cuts criteria to partitioning on directed graphs. Our formulation results in Raylei...
متن کاملOptimization Driven Scenario Grouping
Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. We develop an approach that improves upon these bounds by re-enforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into ‘groups’. Specifically, we formulate an optimization pr...
متن کاملGrouping Based on Phenomenal Proximity.
The question was raised whether the Gestalt law of grouping by proximity is based on proximity of stimuli on the retina or perceived proximity in phenomenal space. To tease apart these 2 possibilities an earlier experiment of Corbin was repeated in which the stimulus array is tilted back into the 3rd dimension. By including a measure of constancy for the perceived distance between points it was...
متن کاملA Grouping-based Evolutionary Algorithm for Constrained Optimization Problem
Most of the existing evolutionary algorithms for constrained problems derate the importance of the infeasible individuals. In these algorithms, feasible individuals might get more possibility to survive and reproduce than infeasible individuals. To recover the utility of infeasible individuals, a grouping-based evolutionary algorithm (GEA) for constrained problems is proposed in this paper. Fea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2012
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2012/170563